Applying the Cluster Method to Count Occurrences of Generalized Permutation Patterns
نویسنده
چکیده
Abstract. We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Steingŕımsson. In particular, we consider those patterns with three letters and one internal dash, as well as permutation statistics composed of counting the number of occurrences of multisets of such patterns. Counting is done via recurrences which simplify in the case of permutations. A collection of Maple procedures implementing these recurrences accompanies the article.
منابع مشابه
Generalized Permutation Patterns — a Short Survey
An occurrence of a classical pattern p in a permutation π is a subsequence of π whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be required to be adjacent in the permutation. Subsets of permutations characterized by the avoidance—or the prescribed number of occurrences— of generalized patterns ...
متن کاملCounting Occurrences of a Pattern of Type (1, 2) or (2, 1) in Permutations
Babson and Steingŕımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of permutations avoiding any single pattern of type (1, 2) or (2, 1). For eight of these twelve patterns the answer is given by the Bell numbers. For the remaining four th...
متن کاملApplying Semi-Markov Models for forecasting the Triple Dimensions of Next Earthquake Occurrences: with Case Study in Iran Area
In this paper Semi-Markov models are used to forecast the triple dimensions of next earthquake occurrences. Each earthquake can be investigated in three dimensions including temporal, spatial and magnitude. Semi-Markov models can be used for earthquake forecasting in each arbitrary area and each area can be divided into several zones. In Semi-Markov models each zone can be considered as a sta...
متن کاملThe complexity of counting poset and permutation patterns
We introduce a notion of pattern occurrence that generalizes both classical permutation patterns as well as poset containment. Many questions about pattern statistics and avoidance generalize naturally to this setting, and we focus on functional complexity problems – particularly those that arise by constraining the order dimensions of the pattern and text posets. We show that counting the numb...
متن کاملPartially Ordered Generalized Patterns and k-ary Words
Recently, Kitaev [9] introduced partially ordered generalized patterns (POGPs) in the symmetric group, which further generalize the generalized permutation patterns introduced by Babson and Steingrı́msson [1]. A POGP p is a GP some of whose letters are incomparable. In this paper, we study the generating functions (g.f.) for the number of k-ary words avoiding some POGPs. We give analogues, exten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009